Efficient Data Aggregation with Secure Bloom Filter in Wireless Sensor Networks

Designing secure data aggregation schemes, which are critical to many sensor network applications, imposes interesting and formidable challenges. In this paper, we propose a succinct and practical secure aggregation protocol by combining HMAC (associated with a cryptographic hash function) with Bloom filter, which then is defined as secure Bloom filter. Unlike most previous approaches, which are aimed to provide security mechanisms for ordinary aggregation operations, our proposal firstly is an effective aggregation protocol, suitable for a specific but popular class of aggregation in wireless sensor networks. Benefiting from secure Bloom filter, the protocol, without any unrealistic assumptions, fulfills the fundamental security objective of preventing outside adversaries and compromised inside nodes from harming the overall network result. We systematically analyze the protocol performance and run extensive simulations on different network scenarios for evaluation. The simulation results demonstrate that the proposed protocol presents remarkable performance on security, communication cost, and degree of node energy consumption balance.